Sets That Contain Their Circle Centers

نویسنده

  • GREG MARTIN
چکیده

The terminology needs a brief explanation. A set S ⊂ R2 is said to contain its circle centers if, for any three non-collinear points from S , the center of the circle through those points is always in S ; in other words, if S contains the vertices of any triangle, then it also contains the triangle’s circumcenter. Several solutions were quickly submitted, and two (outlined in Exercises 1 and 2 below) were posted on the website, along with some discussion. An especially interesting feature of this pair of solutions was that one did not use the assumption that no three points of S lie on a line, while the other did not use the assumption that S is finite! The discussion naturally turned at that point to how much could be said about sets that contain their circle centers. The entire plane S = R2 is a perfectly reasonable example of such a set; less trivially, the set S = Q2, consisting of all points in the plane with rational numbers as coordinates, contains its circle centers (see Exercise 3 below). Are there lots of sets with this property, or only a few? It’s clearly cheating to put all the points of S on a single line, or else there are no circle centers to form. This motivates the following definition:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of the Kinematic Sensitivity and the Greatest Continuous Circle in the Constant-orientation Workspace of Planar Parallel Mechanisms

This paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. This aim is approached upon proceeding single- and multi-objective optimization procedures. Kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...

متن کامل

Clustering of Fuzzy Data Sets Based on Particle Swarm Optimization With Fuzzy Cluster Centers

In current study, a particle swarm clustering method is suggested for clustering triangular fuzzy data. This clustering method can find fuzzy cluster centers in the proposed method, where fuzzy cluster centers contain more points from the corresponding cluster, the higher clustering accuracy. Also, triangular fuzzy numbers are utilized to demonstrate uncertain data. To compare triangular fuzzy ...

متن کامل

Bending the Helicoid

We construct Colding-Minicozzi limit minimal laminations in open domains in R with the singular set of C-convergence being any properly embedded C-curve. By Meeks’ C-regularity theorem, the singular set of convergence of a Colding-Minicozzi limit minimal lamination L is a locally finite collection S(L) of C-curves that are orthogonal to the leaves of the lamination. Thus, our existence theorem ...

متن کامل

Meromorphic Functions Whose Julia Sets Contain a Free Jordan Arc

In the main result of this paper we show that if the Julia set of a meromorphic function f contains a free analytic Jordan arc then it must in fact be a straight line, circle, segment of a straight line or an arc of a circle. If f is transcendental then the Julia set is unbounded and so consists of one or two straight line segments. We construct examples of functions whose Julia sets are of thi...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008